Implementation of a Spatial Parser Generator SPG
نویسندگان
چکیده
منابع مشابه
An Implementation of a Fast Threaded Nondeterministic LL(*) Parser Generator
This paper proposes separating the semantic actions’ execution from the parsing phase. The parser generates a queue of semantic actions attached with grammar rules to be visited in case of successful parsing. By this separation, the execution time of the parsing phase can be enhanced. More importantly, this will avoid the incorrect execution of semantic actions when dealing with non-determinist...
متن کاملEviss: A Visual System Having a Spatial Parser Generator
In this paper, a visual system Eviss is proposed. Visual systems proposed so far have been fixed on certain specifications. It is hard to make and modify such visual systems. Since Eviss has a spatial parser generator based on CMGs, it can construct various visual systems if provided with grammars which consist of production rules. In Eviss, a person who implements a visual system first defines...
متن کاملLR(1) Parser Generator Hyacc
The space and time cost of LR parser generation is high. Robust and effective LR(1) parser generators are rare to find. This work employed the Knuth canonical algorithm, Pager’s practical general method, lane-tracing algorithm, and other relevant algorithms, implemented an efficient, practical and open-source parser generator Hyacc in ANSI C, which supports full LR(0)/LALR(1)/LR(1) and partial ...
متن کاملANTLR: A Predicated- LL(k) Parser Generator
Despite the parsing power of LR=LALR algorithms, e.g. YACC 1, programmers often choose to write recursive-descent parsers by hand to obtain increased flexibility, better error handling, and ease of debugging. We introduce ANTLR, a public-domain parser generator that combines the flexibility of hand-coded parsing with the convenience of a parser generator, which is a component of PCCTS 2. ANTLR ...
متن کاملA CAP parser generator for German
Controlled active procedures are productions that are grouped under and activated by units called 'scouts'. Scouts are controlled by units called 'missions', which also select relevant sections from the data structure for rule application. Following the problem reduction method, the parsing problem is subdivided into ever smaller subproblems, each one of which is represented by a mission. The e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The KIPS Transactions:PartB
سال: 2002
ISSN: 1598-284X
DOI: 10.3745/kipstb.2002.9b.3.383